Solving Project Scheduling Problems by Minimum Cut Computations
نویسندگان
چکیده
منابع مشابه
Solving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations
Rolf H. Möhring • Andreas S. Schulz • Frederik Stork • Marc Uetz Fakultät II, Institut für Mathematik, Technische Universität Berlin, Sekr. MA 6-1, Straße des 17. Juni 136, D-10623 Berlin, Germany Sloan School of Management, E53-361, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 ILOG Deutschland GmbH, Ober-Eschbacher Straße 109, D-61352 Bad Hombu...
متن کاملResource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
We propose a novel approach to compute bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent costs and temporal constraints in the form of time windows, find a feasible schedule of minimum total cost. Motiva...
متن کاملSolving Scheduling Problems by
We deene a general methodology to deal with a large family of scheduling problems. We consider the case when some of the constraints are expressed through the minimization of a loss function. We study with more details a benchmark example consisting in some jigsaw puzzle problem with additional constraints. This is the occasion to discuss some algorithmic issues typical of scheduling problems, ...
متن کاملSolving Maximum Cut Problems by Simulated Annealing
This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compare its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2002
ISSN: 1556-5068
DOI: 10.2139/ssrn.309739